Axiomatic Constructor Classes in Isabelle/HOLCF
نویسندگان
چکیده
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with their laws, and implemented state and resumption monad transformers as generic constructor class instances. This is a step towards our goal of giving modular denotational semantics for concurrent lazy functional programming languages, such as GHC Haskell.
منابع مشابه
Refinements in HOLCF: implementation of interactive systems
In this thesis re nement relations for the logic HOLCF are de ned We compare re ne ment relations de ned by theory interpretations and by model inclusion We use these re nements to implement abstract data types ADTs with LCF domains and continuous functions Therefore the implementation of ADTs may be applied to the implementation of interactive and distributed systems speci ed in HOLCF The impl...
متن کاملHOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF a higher order logic of computable functions The logic HOLCF is based on HOLC a variant of the well known higher order logic HOL which o ers the additional concept of type classes HOLCF extends HOLC with concepts of domain theory such as complete partial orders continuous functions and a xed point operator With the help of type classes the extension can be ...
متن کاملTraces of I/O-Automata in Isabelle/HOLCF
This paper presents a formalization of nite and in nite se quences in domain theory carried out in the theorem prover Isabelle The results are used to model the metatheory of I O automata they are however applicable to any trace based model of parallelism which distinguishes internal and external actions We make use of the logic HOLCF an extension of HOL with domain theory and show how to move ...
متن کاملTraces of I / O - Automata in Isabelle / HOLCFOlaf
This paper presents a formalization of nite and innnite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheory of I/O automata; they are, however, applicable to any trace based model of parallelism which distinguishes internal and external actions. We make use of the logic HOLCF, an extension of HOL with domain theory and show how to ...
متن کاملCertified HLints with Isabelle/HOLCF-Prelude
We present the HOLCF-Prelude, a formalization of a large part of Haskell’s standard prelude in Isabelle/HOLCF. Applying this formalization to the hints suggested by HLint allows us to certify them formally. In pure functional languages such as Haskell, equational reasoning is a valuable tool for refactoring, to improve both efficiency and aesthetics. For example, an experienced programmer would...
متن کامل